Finite Generation and Presentability of Wreath Products of Monoids
نویسنده
چکیده
This paper gives necessary and sufficient conditions for the restricted wreath product of two monoids to be finitely generated or finitely presented.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملSemidirect Products and Wreath Products of Strongly Π-inverse Monoids
In this paper we determine the necessary and sufficient conditions for the semidirect products and the wreath products of two monoids to be strongly π-inverse. Furthermore, we determine the least group congruence on a strongly π-inverse monoid, and we give some important isomorphism theorems.
متن کاملFinite Presentability and Isomorphism of Cayley Graphs of Monoids
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.
متن کاملFor a few elements more: A survey of finite Rees index
This paper makes a comprehensive survey of results relating to finite Rees index for semigroups. In particular, we survey of the state of knowledge on whether various finiteness properties (such as finite generation, finite presentability, automaticity, and hopficity) are inherited by finite Rees index subsemigroups and extensions. We survey other properties that are invariant under passing to ...
متن کاملAutomaton semigroups: New constructions results and examples of non-automaton semigroups
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise as automaton semigroups, and that the class of automaton monoids is closed under forming wreath products with finite monoids. We also consider closure under...
متن کامل